An Extended High-Dimensional Method for Interactive Graph Drawing

نویسنده

  • Hiroshi Hosobe
چکیده

Graph drawing is an information visualization technology for illustrating relations between objects. Interactive graph drawing is often important since it is difficult to statically lay out complex graphs. For the interactive drawing of general undirected graphs, we previously proposed the high-dimensional approach, which used static graph layouts in high-dimensional spaces to dynamically find two-dimensional layouts according to user interaction. Although the resulting interactive graph drawing method was fast, it imposed a limitation on the successive manipulation of dense parts of graphs. In this paper, we propose an extended method to tackle the limitation. Our new method enables multiple graph nodes to be controlled simultaneously in interactive graph drawing. For this purpose, we extend the underlying constraint programming mechanism by introducing the notion of soft constraints as well as by using additional constraints on multiple controlled nodes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Driving Interactive Graph Exploration Using 0-Dimensional Persistent Homology Features

Graphs are commonly used to encode relationships among entities, yet, their abstractness makes them incredibly difficult to analyze. Node-link diagrams are a popular method for drawing graphs. Classical techniques for the node-link diagrams include various layout methods that rely on derived information to position points, which often lack interactive exploration functionalities; and force-dire...

متن کامل

Graph Drawing by High-Dimensional Embedding

We present a novel approach to the aesthetic drawing of undirected graphs. The method has two phases: first embed the graph in a very high dimension and then project it into the 2-D plane using principal components analysis. Running time is linear in the graph size, and experiments we have carried out show the ability of the method to draw graphs of 10 nodes in few seconds. The new method appea...

متن کامل

Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions

We present two algorithms for orthogonal graph drawing in three dimensional space. For a graph with n vertices of maximum degree six, the 3-D drawing is produced in linear time, has volume at most 4.63n and has at most three bends per edge. If the degree of the graph is arbitrary, the vertices are represented by solid 3-D boxes whose surface is proportional to their degree. The produced drawing...

متن کامل

Incremental Orthogonal Graph Drawing in Three Dimensions

We present, two algorithms for orthogonal graph drawing in three dimensional space° For graphs of maximum degree six~ the 3-D drawing is produced in linear time, has volume at most 4.66n ~ and each edge has at most three bends. If the degree of the graph is arbitrary, the vertices are represented by solid 3-D boxes whose surface is proportional to their degree. The produced drawing has two bend...

متن کامل

A Focus and Constraint-Based Genetic Algorithm for Interactive Directed Graph Drawing

This paper presents a user-driven genetic algorithm for directed graph drawing. An interactive framework is considered where users can focus the algorithm on regions of the drawing that need major improvement, or include domain knowledge as layout constraints. The paper describes how focus and user constraints are managed by the genetic algorithm. The combination of user’s skills with automatic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005